Interval scheduling: A survey

In interval scheduling, not only the processing times of the jobs but also their starting times are given. This article surveys the area of interval scheduling and presents proofs of results that have been known within the community for some time. We first review the complexity and approximability of different variants of interval scheduling problems. Next, we motivate the relevance of interval scheduling problems by providing an overview of applications that have appeared in literature. Finally, we focus on algorithmic results for two important variants of interval scheduling problems. In one variant we deal with nonidentical machines: instead of each machine being continuously available, there is a given interval for each machine in which it is available. In another variant, the machines are continuously available but they are ordered, and each job has a given “maximal” machine on which it can be processed. We investigate the complexity of these problems and describe algorithms for their solution. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

直序扩频系统中频信号的同时解扩解调方法

常规直序扩频接收机将中频信号的解扩、解调分立进行,获得的处理增益为扩频码的周期。对于输入信噪比极低的系统,该处理增益难以满足系统低误码率的要求。在基于软件无线电的直序扩频系统中,接收机可以对中频采样信号同时进行解扩解调,分析表明,当采样率满足一定条件时,能够获得比常规方法更高的处理增益,适宜在低信噪比系统中应用。     

存储体编译和布局协同的片上缓存设计方法

为了提高片上缓存的速度、降低面积和功耗,提出了一种存储体编译和布局协同的片上缓存设计方法。该方法基于存储体在芯片上的不同空间位置预估该存储体的时序余量,分别采用拆分/合并、尺寸调整、阈值替换和长宽比变形等多种配置参数穷举组合进行存储体编译,根据时序余量选择最优的静态随机存取存储器存储体编译配置。将该方法与现有的物理设计步骤集成为一个完整的设计流程。实验结果表明,该方法能够降低约9.9%的功耗,同时缩短7.5%的关键路径延时。     

多假设跟踪技术综述

从工程应用的观点出发,对多假设跟踪技术进行综述。描述了从多假设跟踪的萌芽——多目标跟踪的0-1整数规划法,到多假设跟踪方法的形成;由于假设生成过程是算法复杂性决定性的因素,其中量测个数和航迹合并长度又起关键作用。对该问题进行了重点的回顾;进一步MHT实用化的关键是如何克服算法的复杂性,K-最优假设法为算法应用带来希望。同时,对多假设跟踪其它相关技术的发展也进行了简要叙述。     

多窗口谱图分析的低截获概率雷达信号识别

在当前复杂的战场环境中,低截获概率雷达信号因其具有大时宽带宽积、强干扰性能、高分辨率和低截获性特点得到了广泛应用,传统的雷达侦察手段很难对其进行有效识别.在低截获概率雷达典型调制分析的基础之上,研究基于人工智能的雷达信号分类识别方法.从低截获概率雷达信号时频特征入手,提出基于多窗口时频谱图分析方法.该算法采用Hermi...     

Ku波段低噪声放大器的设计

运用ADS仿真设计工具,应用Fujitsu公司的FHX04X管芯,分析设计了一个Ku波段的二级平衡式低噪声放大器,在14 GHz～16 GHz的频率范围内获得了低于2 dB的噪声系数,大于16 dB的增益,同时满足输入输出驻波比小于2,输出1 dB压缩功率点大于8 dBm.并和单端电路形式的设计结果进行了比较.     

Some elementary ideas concerning the complexity of system structure

A system of iid Bernoulli components is the starting point in the statistical theory of reliability. This simplification allows for the development of a rich, though elementary, theory for the structure of the system. Two representations play a prominent role in the study of structural reliability. One is the minimal path set representation and the other is the signature representation. By combining the two representations with the Gibbs measure for the state of components, one obtains terms that can be interpreted as the complexity of the system structure. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

水雷主动声引信低截获特性分析

从声纳方程和信号检测两方面分析了主动声引信实现低截获的可行性和技术途径.数据仿真表明,接收机检测阈在6 dB以下,有数量级为104以上的信号长度,发射波形为随机形式时,水雷主动引信实现低截获特性是可行的.     

精密轴承低噪声润滑脂研究进展

随着社会的发展和科学技术的进步,人们对降低设备噪声的要求越来越高,特别是办公设备、家用电器及某些军事装备在这方面的要求更为突出。使用低噪声润滑脂是降低精密滚动轴承噪声的重要途径。综述了国内外低噪声润滑脂的研究情况,探讨了润滑脂组成、制脂工艺、结构及杂质对轴承振动和噪声的影响,分析了低噪声润滑脂下一步的发展方向。     

Scheduling parallel dedicated machines with the speeding‐up resource

We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two‐machine problem is NP‐hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst‐case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple‐choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008